منابع مشابه
) Ever Be Amenable?
It is known that B(l) is not amenable for p = 1, 2,∞, but whether or not B(l) is amenable for p ∈ (1,∞) \ {2} is an open problem. We show that, if B(l) is amenable for p ∈ (1,∞), then so are l(B(l)) and l(K(l)). Moreover, if l(K(l)) is amenable so is l(I,K(E)) for any index set I and for any infinite-dimensional Lspace E; in particular, if l(K(l)) is amenable for p ∈ (1,∞), then so is l(K(l ⊕ l...
متن کاملAwake, Arise, or Be for Ever Fall’n
"Pieter Bruegel was the most perfect of his century," said Flemish cartographer and geographer Abraham Ortelius eulogizing his friend, who "was taken from us while still in his full manhood." Both men observed and delineated new and original angles of reality, Ortelius in his great atlas (Theater of the World), Bruegel in his paintings, which described, in astonishingly modern terms, the lives ...
متن کاملWill xenotransplantation ever be feasible?
In several recent conferences, the principal questions have been whether xenotransplantation technology should be encouraged and, if so, how it should be regulated. Because the prospect of successful transplantation of animal organs into humans is still remote, the rush to achieve consensus about clinical application would be inexplicable were it not for two ostensibly unrelated issues. The fir...
متن کاملCan viruses ever be useful?
M ost of the terms used for computer viruses arc metaphors: they have a largely medical origin, and are seductive if not literally sexy. The very real worries WC have about AIDS, for example, no doubt colour the way we talk about computer viruses. At the extreme, abstractly viruses arc clearly just algorithms, and like any other algorithm they arc good for some things and not good for others. T...
متن کاملShould Static Search Trees Ever Be Unbalanced?
In this paper we study the question of whether or not a static search tree should ever be unbalanced. We present several methods to restructure an unbalanced k-ary search tree T into a new tree R that preserves many of the properties of T while having a height of log k n+1 which is one unit off of the optimal height. More specifically, we show that it is possible to ensure that the depth of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1999
ISSN: 0028-0836,1476-4687
DOI: 10.1038/21299